GENERATION OF RECTANGULAR DISSECTIONS USING DIRECTED ADJACENCY GRAPH
نویسندگان
چکیده
منابع مشابه
Hexadecimal Grid Graph Representation of Multilayer Rectangular Dissections
Multilayer rectangular dissections have been considered such as models of multi page books in spreadsheets, 3D floor plans and stratum maps in terrain surfaces. In this paper, we deal with a representation of the multilayer rectangular dissections that are effective for ruled line oriented operations and introduce hexadecimal grids corresponding to multilayer rectangular dissections. And we sho...
متن کاملDrawing Weighted Directed Graph from It's Adjacency Matrix
This paper proposes an algorithm for buUdmg weighted directed graph,defmes the weighted directed relationship matrix of the graph,an d describes algorithm implementation using this matrix.Based on this algorithm ,an effective way for building an d drawing weighted directed graphs is presented,forming a foundation for visual implementation of the algorithm in the graph theory.
متن کاملGraph Matching using Adjacency Matrix Markov Chains
This paper describes a spectral method for graph-matching. We adopt a graphical models viewpoint in which the graph adjacency matrix is taken to represent the transition probability matrix of a Markov chain. The nodeorder of the steady state random walk associated with this Markov chain is determined by the co-efficent order of the leading eigenvector of the adjacency matrix. We match nodes in ...
متن کاملAdjacency Preserving Mappings of Rectangular Matrices
Let D be a division ring and let m,n be integers ≥ 2. Let Mm×n(D) be the space of m × n matrices. In the fundamental theorem of the geometry of rectangular matrices all bijective mappings φ of Mm×n(D) are determined such that both φ and φ−1 preserve adjacency. We show that if a bijective map φ of Mm×n(D) preserves the adjacency then also φ −1 preserves the adjacency. Thus the supposition that φ...
متن کاملDirected prime graph of non-commutative ring
Prime graph of a ring R is a graph whose vertex set is the whole set R any any two elements $x$ and $y$ of $R$ are adjacent in the graph if and only if $xRy = 0$ or $yRx = 0$. Prime graph of a ring is denoted by $PG(R)$. Directed prime graphs for non-commutative rings and connectivity in the graph are studied in the present paper. The diameter and girth of this graph are also studied in the pa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Architecture and Planning (Transactions of AIJ)
سال: 2001
ISSN: 1340-4210,1881-8161
DOI: 10.3130/aija.66.161_4